class MyCircularQueue {
    public int[]array ;

    public MyCircularQueue(int k) {
        array = new int[k + 1];
    }

    public int front = 0;
    public int rear = 0;

    public boolean enQueue(int value) {
        if(isFull()){
            return false;
        }
        array[rear] = value;
        rear = (rear + 1) % array.length;
        return true;
    }
    
    public boolean deQueue() {
        if(isEmpty()){
            return false;
        }
        front = (front + 1) % array.length;
        return true;
    }
    
    public int Front() {
        if(isEmpty()){
            return -1;
        }

        return array[front];
    }
    
    public int Rear() {
        if(isEmpty()){
            return -1;
        }
        int index = (rear == 0) ? array.length - 1 : rear -1;
        return array[index];
    }
    
    public boolean isEmpty() {
        return front == rear;
    }
    
    public boolean isFull() {
        return (rear + 1) % array.length == front;
    }
}